Modelling hierarchical and modular complex networks: division and independence

We introduce a growing network model which generates both modular and hierarchical structure in a self-organized way. To this end, we modify the Barabási–Albert model into the one evolving under the principles of division and independence as well as growth and preferential attachment (PA). A newly added vertex chooses one of the modules composed of existing vertices, and attaches edges to vertices belonging to that module following the PA rule. When the module size reaches a proper size, the module is divided into two, and a new module is created. The karate club network studied by Zachary is a simple version of the current model. We find that the model can reproduce both modular and hierarchical properties, characterized by the hierarchical clustering function of a vertex with degree k, CðkÞ; being in good agreement with empirical measurements for real-world networks. r 2005 Elsevier B.V. All rights reserved. PACS: 89.65. s; 89.75.Hc; 89.75.Da